halting problem造句

• We say that the halting problem is
  我们说停机问题在图灵机上是
• The first area is represented by the " halting problem " in computer science
  第一个领域的代表是计算机科学中的“停机问题” 。
• It turns out that proving programs correct is equivalent to solving the halting problem
  证明程序是正确的等价于解决停机问题。
• Alan turing proved in 1936 that a general algorithm to solve the halting problem for all possible inputs cannot exist
  Alan turing在1936年证明了对所有可能输入解决停机问题的通用算法是不存在的。
• From a theoretical point of view , the separation of data and code in von neumann machines is equivalent to the halting problem ; hence , a complete static translation is not possible
  从理论上说，分离von neumann上的数据和代码就好象停机问题，因此完全的静态翻译是不可能的。